منابع مشابه
Fixpoint semantics and simulation
A general functorial framework for recursive deenitions is presented in which simulation of a deenition scheme by another one implies an ordering between the values deened by these schemes in an arbitrary model. Under mild conditions on the functor involved, the converse implication also holds: a model is constructed such that, if the values deened are ordered, there is a simulation between the...
متن کاملAsmL Semantics in Fixpoint
AsmL is a novel executable specification language based on the theory of Abstract State Machines (ASMs). It represents one of the most powerful practical engines to write and execute ASMs. In this report, we present a proven complete small-step trace-based operational semantics of the main parts of AsmL. Such a semantics provides precise and non ambiguous definitions of AsmL. It is very useful ...
متن کاملMultiagent Compromises and Joint Fixpoint Semantics
We assume the requirements or desi res of an agent are modeled by a logic program. In a multi-agent setting, a joint decision of the agents, reflecting a compromise of t he various requirements, corresponds to a suitable joint model of the respective logic programs. In this paper, an appropriate semantics for selecting joint models representing compromises is proposed: the joint fixpoint semant...
متن کاملFixpoint semantics for logic programming a survey
The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic p...
متن کاملFixpoint semantics for active integrity constraints
Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints are violated. The intuitions regarding which repairs are “good” given such a description are closely related to intuitions that live in various areas of non-monotonic reasoning, such as log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00176-5